Select and Forward: Unifying Cooperative Diversity and Routing in a common framework

نویسندگان

  • Aggelos Bletsas
  • Ashish Khisti
چکیده

We study the diversity multiplexing tradeoff in cooperative diversity systems involving multiple relays. We show that distributed space time codes are not always fundamentally necessary in realizing the potential gains in these systems. In particular, under a wide variety of scenarios, we show that a smart relay selection algorithm in conjunction with conventional protocols for the three node system can achieve the same diversity-multiplexing tradeoff achieved by multiple relay systems using distributed space-time codes. We consider both, schemes that select relay before the the source transmission (proactive relay selection) and schemes that select the relay after the source transmission (reactive relay selection) and observe that their performance in terms of the diversity-multiplexing tradeoff are identical. We then consider systems where the destination is able to send a single-bit decision feedback and show that one can achieve the diversity multiplexing tradeoff of a multi-input-single-output antenna system. Our results present an alternative to distributed space-time codes for realizing the potential gains in multiple relay, user cooperation systems and open new avenues for fruitful interaction between routing and cooperative diversity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Power Management to Minimize SER in Amplify and-Forward Relay Networks

This paper studies optimal power allocation to minimize symbol error rate (SER) of amplify-and-forward cooperative diversity networks. First, we analytically solve optimal power allocation problem to minimize SER for three different scenarios, namely, multi-branch single-relay, single-branch multi-relay and multi-branch multi-relay cooperative diversity networks, all subject to a given total re...

متن کامل

Cooperative vehicle routing problem: an opportunity for cost saving

In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...

متن کامل

Closed loop supply chain planning with vehicle routing

In the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. On the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. Effective transport activities are also one of the most important c...

متن کامل

Performance Analysis of the Link-adaptive Cooperative Amplify-and-forward Relay Networks with Opportunistic Relaying Strategy

This paper analyzes the performance of cooperative amplify-and-forward (CAF) relay networks that employ adaptive M-ary quadrature amplitude modulation (M-QAM)/M-ary phase shift keying (M-PSK) digital modulation techniques in Nakagami-m fading channel. In particular, we present and compared the analysis of CAF relay networks with different cooperative diversity and opportunistic routing strategi...

متن کامل

A Theoretical Analysis of Cooperative Diversity in Wireless Sensor Networks

We propose here an analytical framework to quantify the impact of cooperative diversity on the energy consumption and lifetime of sensor networks. It is well accepted that cooperative diversity increases energy efficiency in fading environments. However, previous works have not analyzed, from a theoretical perspective, these benefits in a network setting. This paper presents a theoretical frame...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005